cellular rules

cellular rules
правила взаимодействия соседних клеток клеточного автомата, правила для клеток
см. тж. cellular automata, non-uniform CA, uniform CA

Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.

Игры ⚽ Нужна курсовая?

Смотреть что такое "cellular rules" в других словарях:

  • Cellular automaton — A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states …   Wikipedia

  • Cellular Potts model — The cellular Potts model is a lattice based computational modeling method to simulate the collective behavior of cellular structures. Other names for the CPM are extended large q Potts model and Glazier and Graner model. First developed by James… …   Wikipedia

  • Cellular image processing — There is a special kind of physical platform called cellular automata that can perform different kinds of computation. Although the principle of cellular automata is very attractive, it is difficult to build a general purpose computer based on it …   Wikipedia

  • cellular automata (CA) — Simplest model of a spatially distributed process that can be used to simulate various real world processes. Cellular automata were invented in the 1940s by John von Neumann and Stanislaw Ulam at Los Alamos National Laboratory. They consist of a… …   Universalium

  • Life-like cellular automaton — A cellular automaton (CA) is Life like (in the sense of being similar to Conway s Game of Life) if it meets the following criteria: The array of cells of the automaton has two dimensions. Each cell of the automaton has two states (conventionally… …   Wikipedia

  • Block cellular automaton — The Margolus neighborhood for a two dimensional block cellular automaton. The partition of the cells alternates between the set of 2 × 2 blocks indicated by the solid blue lines, and the set of blocks indicated by the dashed red lines. A block… …   Wikipedia

  • Cyclic cellular automaton — A one dimensional cyclic cellular automaton with n = 4, run for 300 steps from a random initial configuration. The cyclic cellular automaton is a cellular automaton rule developed by David Griffeath and studied by several other cellular automaton …   Wikipedia

  • Majority problem (cellular automaton) — The majority problem, or density classification task is the problem of finding one dimensional cellular automaton rules that accurately perform majority voting. Using local transition rules, cells cannot know the total count of all the ones in… …   Wikipedia

  • Von Neumann cellular automaton — Von Neumann cellular automata are the original expression of cellular automata, the development of which were prompted by suggestions made to John von Neumann by his close friend and fellow mathematician Stanisław Ulam. Their original purpose was …   Wikipedia

  • U.S. Cellular Field — (New) Comiskey Park The Cell …   Wikipedia

  • Movable cellular automaton — method Movable cellular automaton actively changed self neighbors by means switching neighbors state from linked to unlinked and vice versa (modeling of contact interaction) Method type Continuous/Discrete Discrete …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»